Student Project in Theoretical Computer Science BOUNDED MODEL CHECKING OF 1-BOUNDED PETRI NETS USING A SATISFIABILITY BASED PLANNER
نویسنده
چکیده
منابع مشابه
Bounded Model Checking High Level Petri Nets in PIPE+Verifier
High level Petri nets (HLPNs) have been widely applied to model concurrent and distributed systems in computer science and many other engineering disciplines. However, due to the expressive power of HLPNs, they are more difficult to analyze. Exhaustive analysis methods such as traditional model checking based on fixed point calculation of state space may not work for HLPNs due to the state expl...
متن کاملBounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. More specifically, we translate the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability. We consider three semantics: process, step, and interleaving semantics. We show t...
متن کاملSMT-Based Reachability Checking for Bounded Time Petri Nets
Time Petri nets by Merlin and Farber are a powerful modelling formalism. However, symbolic model checking methods for them consider in most cases the nets which are 1-safe, i.e., allow the places to contain at most one token. In our paper we present a preliminary version of the approach aimed at testing reachability for time Petri nets without this restriction. We deal with the class of bounded...
متن کاملSAT-Based Verification of Safe Petri Nets
Bounded model checking has received recent attention as an efficient verification method. The basic idea behind this new method is to reduce the model checking problem to the propositional satisfiability decision problem or SAT. However, this method has rarely been applied to Petri nets, because the ordinary encoding would yield a large formula due to the concurrent and asynchronous nature of P...
متن کاملAnswer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier work where bounded model checking has been used for verification of sequential digital circuits. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. A mapping fr...
متن کامل